The Compactness Lower Bound of Shortest-Path Interval Routing on n x n Tori with Random Faulty Links
ثبت نشده
چکیده
منابع مشابه
Efficient Deadlock-Free Multi-dimensional Interval Routing in Interconnection Networks
Abst rac t : We present deadlock-free packet (wormhole) routing algorithms based on multi-dimensional interval schemes for cert~n multiprocessor interconnection networks and give their analysis in terms of the compactness and the size (the maximum number of buffers per node (per link)). The issue of a simultaneous reduction of the compactness and the size is fundamental, worth to investigate an...
متن کاملThe Complexity of Shortest Path and Dilation Bounded Interval Routing
Interval routing is a popular compact routing method for point-to-point networks which found industrial applications in novel transputer routing technology 13]. Recently much eeort is devoted to relate the eeciency (measured by the dilation or the stretch factor) to space requirements (measured by the compactness or the total number of memory bits) in a variety of compact We add new results in ...
متن کاملInterval Routing on Layered Cross Product of Trees and Cycles
Interval routing is an attractive space-efficient routing method for point-to-point networks (introduced in [13] and [15]) which has found industrial applications in the INMOS T9000 transputer design. Surveys of the principal theoretical results as well as recent trends in the area of interval routing can be found in [16, 5, 11]. Interval routing is based on compact routing tables, in which the...
متن کاملOn the Compactness of Bounded Degree Graphs for Shortest Path Interval Routing
Consider shortest path interval routing, a popular memory-balanced method for solving the routing problem on arbitrary networks. Given a network G, let Irs(G) denote the maximum number of intervals necessary to encode groups of destinations on an edge, minimized over all shortest path interval routing schemes on G. In this paper, we establish a worst case bound on Irs(G). More precisely for eve...
متن کاملAdaptive Fault-Tolerant Routing in Hypercube Multicomputers
A connected hypercube with faulty links and/or nodes is called an injured hypercube. To enable any non-faulty node to communicate with any other non-faulty node in an injured hypcrcube, the information on component failures has to be made available to non-faulty nodes so as to route messages around the faulty components. We propose first a distributed adaptive fault-tolerant routing scheme for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002